Distance domination of generalized de Bruijn and Kautz digraphs
نویسندگان
چکیده
منابع مشابه
On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs
This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets ...
متن کاملRainbow Domination in Generalized de Bruijn Digraphs
In this paper, we are concerned with the krainbow domination problem on generalized de Bruijn digraphs. We give an upper bound and a lower bound for the k-rainbow domination number in generalized de Bruijn digraphs GB(n, d). We also show that γrk(GB(n, d)) = k if and only if α 6 1, where n = d+α and γrk(GB(n, d)) is the k-rainbow domination number of GB(n, d).
متن کاملOn the power domination number of de Bruijn and Kautz digraphs
Let G = (V,A) be a directed graph without parallel arcs, and let S ⊆ V be a set of vertices. Let the sequence S = S0 ⊆ S1 ⊆ S2 ⊆ · · · be defined as follows: S1 is obtained from S0 by adding all out-neighbors of vertices in S0. For k > 2, Sk is obtained from Sk−1 by adding all vertices w such that for some vertex v ∈ Sk−1, w is the unique out-neighbor of v in V \ Sk−1. We set M(S) = S0 ∪S1 ∪ · ...
متن کاملDe Bruijn and Kautz bus networks
Our aim is to nd bus interconnection networks which connect as many processors as possible, for given upper bounds on the number of connections per processor, the number of processors per bus and the network diameter. Point-to-point networks are a special case of bus networks in which every bus connects only two processors. In this case de Bruijn and Kautz networks and their generalizations are...
متن کاملBisecting de Bruijn and Kautz Graphs
De Bruijn and Kautz graphs have been intensively studied as perspective interconnection networks of massively parallel computers. One of the crucial parameters of an interconnection network is its bisection width. It has innuence on both communication properties of the network and the algorithmic design. We prove optimal bounds on the edge and vertex bisection widths of the k-ary n-dimensional ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Mathematics in China
سال: 2016
ISSN: 1673-3452,1673-3576
DOI: 10.1007/s11464-016-0607-y